Techniques for targeted botnet protection

ABSTRACT

A botnet identification module identifies members of one or more botnets based upon network traffic destined to one or more servers over time, and provides sets of botnet sources to a traffic monitoring module. Each set of botnet sources includes a plurality of source identifiers of end stations acting as part of a corresponding botnet. A traffic monitoring module receives the sets of botnet sources from the botnet identification module, and upon a receipt of traffic identified as malicious that was sent by a source identified within one of the sets of botnet sources, activates a protection mechanism with regard to all traffic from all of the sources identified by the one of the sets of botnet sources for an amount of time.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of application Ser. No. 15/442,560,filed Feb. 24, 2017, which claims priority from U.S. ProvisionalApplication No. 62/300,069, filed on Feb. 25, 2016, the contents ofwhich are incorporated by reference.

FIELD

Embodiments relate to the field of computer networking; and morespecifically, to techniques for botnet identification and targetedbotnet protection.

BACKGROUND

A botnet is a group of Internet-connected computing devicescommunicating with other similar machines in an effort to completerepetitive tasks and objectives. Botnets can include computers whosesecurity defenses have been breached and control conceded to a thirdparty. Each such compromised device, known as a “bot,” may be createdwhen a computer is penetrated by software from a malware (i.e., amalicious software) distribution. The controller of a botnet is able todirect the activities of these compromised computers throughcommunication channels formed by standards-based network protocols suchas Internet Relay Chat (IRC), Hypertext Transfer Protocol (HTTP), etc.

Computers can be co-opted into a botnet when they execute malicioussoftware. This can be accomplished by luring users into making adrive-by download, exploiting web browser vulnerabilities, or bytricking the user into running a Trojan horse program, which could comefrom an email attachment. This malware typically installs modules thatallow the computer to be commanded and controlled by the botnet'soperator. After the software is executed, it may “call home” to the hostcomputer. When the re-connection is made, depending on how it iswritten, a Trojan may then delete itself, or may remain present toupdate and maintain the modules. Many computer users are unaware thattheir computer is infected with bots.

Botnets can include many different computers (e.g., hundreds, thousands,tens of thousands, hundreds of thousands, or more) and the membership ofa botnet can change over time.

One type of attack perpetrated by botnets is a distributeddenial-of-service (DDoS) attack, in which multiple systems submit asmany requests as possible to a single Internet computer or service,overloading it and preventing it from servicing legitimate requests.

The geographic dispersal of botnets typically means that eachparticipant must be individually identified, which limits the benefitsof filtering mechanisms. Although a service provider could choose toblock all traffic during a botnet attack, this negatively impactsexisting users of the service. Further, a service provider could chooseto allow all traffic to continue to be processed, but this cansignificantly affect its quality of service to its regular users, andpotentially even “crash” the service altogether. Moreover, it can betremendously difficult to determine which requests for a service aremalicious and which are not, making it very challenging to attempt toselectively deal with only the malicious traffic.

Accordingly, improved techniques for identifying botnet traffic andprotecting services from botnet attacks are desired.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention may best be understood by referring to the followingdescription and accompanying drawings that are used to illustrateembodiments of the invention. In the drawings:

FIG. 1 is a block diagram illustrating botnet member identification andtargeted botnet protection according to some embodiments.

FIG. 2 is a flow diagram illustrating operations for botnet memberidentification and targeted botnet protection according to someembodiments.

FIG. 3 is a flow diagram illustrating exemplary operations for botnetmember identification according to some embodiments.

FIG. 4 is a block diagram illustrating botnet member identificationaccording to some embodiments.

FIG. 5 is a flow diagram illustrating exemplary operations for targetedbotnet protection according to some embodiments.

FIG. 6 is a block diagram illustrating an exemplary on premisedeployment environment for a traffic monitoring module and/or botnetidentification module according to some embodiments.

FIG. 7 is a block diagram illustrating an exemplary cloud-baseddeployment environment for a traffic monitoring module and/or botnetidentification module according to some embodiments.

FIGS. 8-11 illustrate operations for botnet member identificationaccording to some embodiments, in which:

FIG. 8 is a block diagram illustrating exemplary operations includingmalicious event identification for botnet member identificationaccording to some embodiments.

FIG. 9 is a block diagram illustrating exemplary operations includingtraffic source similarity determination for botnet memberidentification, which can be performed after the operations of FIG. 8,according to some embodiments.

FIG. 10 is a block diagram illustrating exemplary operations includingperiodic-source cluster generation for botnet member identification,which can be performed after the operations of FIG. 9, according to someembodiments.

FIG. 11 is a block diagram illustrating exemplary operations includingattacking-clusters graph generation and botnet identification for botnetmember identification, which can be performed after the operations ofFIG. 10, according to some embodiments.

FIG. 12 is a flow diagram illustrating exemplary operations forproviding targeted botnet protection according to some embodiments.

FIG. 13 is a flow diagram illustrating exemplary operations forproviding targeted botnet protection according to some embodiments.

FIG. 14 is a flow diagram illustrating exemplary operations foridentifying a subset of a plurality of end stations that collectivelyact as a suspected botnet according to some embodiments.

DESCRIPTION OF EMBODIMENTS

In the following description, numerous specific details such as logicimplementations, resource partitioning/sharing/duplicationimplementations, types and interrelationships of system components, andlogic partitioning/integration choices are set forth in order to providea more thorough understanding of the present invention. It will beappreciated, however, by one skilled in the art that the invention maybe practiced without such specific details. In other instances, controlstructures, gate level circuits and full software instruction sequenceshave not been shown in detail in order not to obscure the invention.Those of ordinary skill in the art, with the included descriptions, willbe able to implement appropriate functionality without undueexperimentation.

Bracketed text and blocks with dashed borders (e.g., large dashes, smalldashes, dot-dash, and dots) are used herein to illustrate optionaloperations that add additional features to embodiments of the invention.However, such notation should not be taken to mean that these are theonly options or optional operations, and/or that blocks with solidborders are not optional in certain embodiments of the invention.

References in the specification to “one embodiment,” “an embodiment,”“an example embodiment,” etc., indicate that the embodiment describedmay include a particular feature, structure, or characteristic, butevery embodiment may not necessarily include the particular feature,structure, or characteristic. Moreover, such phrases are not necessarilyreferring to the same embodiment. Further, when a particular feature,structure, or characteristic is described in connection with anembodiment, it is submitted that it is within the knowledge of oneskilled in the art to affect such feature, structure, or characteristicin connection with other embodiments whether or not explicitlydescribed.

In the following description and claims, the terms “coupled” and“connected,” along with their derivatives, may be used. It should beunderstood that these terms are not intended as synonyms for each other.“Coupled” is used to indicate that two or more elements, which may ormay not be in direct physical or electrical contact with each other,co-operate or interact with each other. “Connected” is used to indicatethe establishment of communication between two or more elements that arecoupled with each other. Further, although a Uniform Resource Locator(URL) is one type of Uniform Resource Identifier (URI), these terms areused interchangeably herein to refer to a URI, which is a string ofcharacters used to identify a name or a web resource.

The techniques shown in the figures can be implemented using code anddata stored and executed on one or more electronic devices (e.g., an endstation, a network device). Such electronic devices, which are alsoreferred to as computing devices, store and communicate (internallyand/or with other electronic devices over a network) code and data usingcomputer-readable media, such as non-transitory computer-readablestorage media (e.g., magnetic disks; optical disks; random access memory(RAM); read only memory (ROM); flash memory devices; phase-changememory) and transitory computer-readable communication media (e.g.,electrical, optical, acoustical or other form of propagated signals,such as carrier waves, infrared signals, digital signals). In addition,such electronic devices include hardware, such as a set of one or moreprocessors coupled to one or more other components, e.g., one or morenon-transitory machine-readable storage media to store code and/or data,and a set of one or more wired or wireless network interfaces allowingthe electronic device to transmit data to and receive data from othercomputing devices, typically across one or more networks (e.g., LocalArea Networks (LANs), the Internet). The coupling of the set ofprocessors and other components is typically through one or moreinterconnects within the electronic device, (e.g., busses and possiblybridges). Thus, the non-transitory machine-readable storage media of agiven electronic device typically stores code (i.e., instructions) forexecution on the set of one or more processors of that electronicdevice. Of course, one or more parts of various embodiments may beimplemented using different combinations of software, firmware, and/orhardware.

Embodiments described herein provide for methods, systems,non-transitory computer readable media, and apparatuses for botnetidentification and for targeted botnet protection.

In some embodiments, members of a botnet can be identified by observingincoming traffic to a set of servers (e.g., web application servers)over time, finding behavior-similarity between the sources of thetraffic that is malicious by examining the traffic broken intotime-periods, and finding associates between sets of sources that havemany members and persist over a long time duration. In some embodiments,sets of botnet sources can thus be identified, where each set of botnetsources includes multiple source identifiers (e.g., Internet Protocol(IP) addresses utilized by the end stations participating in aparticular botnet).

In some embodiments, sets of botnet sources can be utilized to enabletargeted botnet protection. A traffic monitoring module, upon detectingincoming traffic destined to a server that is deemed as maliciousaccording to a security rule, can identify whether the source of thatmalicious traffic is identified within any of the sets of botnetsources. When the source of the received malicious traffic is determinedto be within one of the sets of botnet sources, security measures can beactivated for any further traffic received from any of the sources ofthat one set of botnet sources for a period of time. Accordingly,instead of following a naive approach of immediately blocking alltraffic from all of the sets of botnet sources—which would likelyinterrupt some non-malicious traffic, as many devices acting as part ofa botnet are frequently used for non-malicious purposes—some embodimentscan protect against attacks from these botnets with a fine-grainedapproach that is limited to an attacking botnet, and can be limited to aparticular time period (e.g., the length of the attack), to therebyallow subsequent non-malicious activity from those sources to beprocessed in an uninterrupted manner

FIG. 1 is a block diagram illustrating a system 100 providing botnetmember identification and targeted botnet protection according to someembodiments. Although “botnet member identification” and “targetedbotnet protection” may be described together in this Figure andthroughout this description, it is to be understood that thesetechniques may also be separately/individually utilized without theother technique.

In FIG. 1, a set of one or more server end stations 110 execute orotherwise implement one or more servers 111 providing access to data. Inthe embodiment depicted in this Figure, the server end stations 110implement a web application server 116, though in other embodiments theset of server end stations 110 can enable other types of servers,including but not limited to database servers, file servers, printservers, mail servers, gaming servers, application servers, Domain NameSystem (DNS) servers, etc.

The set of server end stations 110 may be “protected” by a securitygateway 102. Security gateways 102—such as firewalls, databasefirewalls, file system firewalls, and web application firewalls(WAFs)—are network security systems that protect software applications(e.g., web application server(s) 116 or servers 111) executing onelectronic devices (e.g., server end station(s) 110) within a network bycontrolling the flow of network traffic passing through the securitygateway 102. By analyzing packets flowing through the security gateway102 and determining whether those packets should be allowed to continuetraveling through the network, the security gateway 102 can preventmalicious traffic from reaching a protected server, modify the malicioustraffic, and/or create an alert to trigger another responsive event ornotify a user of the detection of the malicious traffic.

In some embodiments, the security gateway 102 is communicatively coupledbetween one or more client end stations 120A-120N and the server endstations 110, such that all traffic destined to the server end stations110 is first passed through (or made available to) the security gateway102 for analysis. In some embodiments, the security gateway 102 executesas part of a separate server end station or a (dedicated or shared)network device; but in other embodiments, the security gateway 102operates as part of server end station(s) 110 (for example, as asoftware module), or is implemented using or another type of electronicdevice and can be software, hardware, or a combination of both. Furtherdetail regarding security gateways will be described later herein withregard to FIGS. 6 and 7.

Client end stations 120A-120N (e.g., workstations, laptops, netbooks,palm tops, mobile phones, smartphones, multimedia phones, Voice overInternet Protocol (VoIP) phones, user equipment (UE), terminals,portable media players, Global Positioning Satellite (GPS) units, gamingsystems, set-top boxes, etc.) are computing devices operable to executeapplications 126 that, among other functions, can access thecontent/services provided by other computing devices, such as the serverend stations 110.

In this example, the client end stations 120 include one (or possiblymultiple) malware 122 modules that cause the client end stations 120 toparticipate in one (or more) botnets 104A-104N. In some cases, a clientend station (e.g., 120A) may be infected with malware 122 while the user(e.g., owner/operator) of the client end station is unaware of theinfection. Thus, the user may continue to operate their client endstation in a non-malicious manner, and the client end station may act aspart of a botnet (e.g., receive commands from a controller, begintransmitting malicious traffic, etc.) and perform malicious actionswithout the user's knowledge, perhaps even concurrently while the useris actively utilizing the client end station.

In some embodiments, a traffic monitoring module 104 or “TMM” (which maybe implemented within a security gateway 102) can be configured toreceive network traffic from client end stations 120 that is directed toone or more server(s) 111, and provide traffic data 108 (e.g., rawtraffic/captures of packets, “event” data structures that representcertain traffic, etc.) to a botnet identification module (“BIM”) 106 atcircle ‘1’. In some embodiments, the BIM 106 may receive such trafficdata 108 from only one deployment 112A (e.g., one or more trafficmonitoring modules 104 of a particular enterprise, network, etc.),though in other embodiments the BIM 106 may receive such traffic data108 from multiple deployments 112A-112N.

In some embodiments, the BIM 106 performs an analysis of this trafficdata 108 at circle ‘2’ to determine one or more sets of botnet sources.Each set of botnet sources from the one or more sets of botnet sourcescan be specific to a particular botnet, and include source identifiersfor each client end station determined to belong to that botnet (or,determined as being highly likely as belonging to a botnet). In someembodiments, each source identifier comprises an IP address, such as anIPv4 address or IPv6 address. Further detail describing exemplarytechniques for botnet membership determinations is presented laterherein with regard to FIGS. 3 and 4.

At circle ‘3’, the determined sets of botnet sources 114 can be providedfrom the BIM 106 to one or more TMMs 104, which may be located at one ormore deployments 112A-112N.

In some embodiments, the TMM 104 can utilize the sets of botnet sources114 to protect the server(s) 111 (and/or other infrastructure) againstthe identified botnets. A partial representation of sets of botnetsources 114 is illustrated herein as including (at least) three sets ofbotnet sources. A first set of botnet sources is illustrated asincluding at least three sources: 1.1.1.1, 2.2.2.2, and 5.5.5.5. Asecond set of botnet sources is illustrated as including at least threesources: 2.2.2.2, 4.4.4.4, and 6.6.6.6. A third set of botnet sources isillustrated as including at least three sources: 7.7.7.7, 8.8.8.8, and9.9.9.9. Of course, more or fewer sets of botnet sources may be used,and the sets of botnet sources may include more or fewer sourceidentifiers. Additionally, in some scenarios a single source identifier(e.g., 2.2.2.2) may exist in multiple different ones of the sets (suchas when a single client end station using that IP address has beeninfected with multiple malware types and thus is a member of multiplebotnets), though in other scenarios this may not be the case.

At circle ‘4’, the TMM 104 may receive malicious traffic 130A from asource “6.6.6.6” (from client end station 120A), and analyze the traffic130A (e.g., according to security rules) to determine that it is in factmalicious. The TMM 104 may be configured to perform a protective actionat circle ‘5’ in response, such as blocking the traffic 130A (e.g.,dropping the packets so that they are not sent to the destinationserver), downgrading the priority of the traffic in beingprocessed/forwarded, modifying the traffic, reporting the incident toanother device or human user, etc.

In some embodiments, the TMM 104 can also consult the sets of botnetsources 114 by performing a lookup using a source identifier from themalicious traffic 130A. For example, a source IP address from an IPheader of the traffic may serve as a source identifier, though othersource identifiers can also be used, including but not limited to avalue from a User-Agent header field of an HTTP request message (whichmay be able to uniquely identify a source), an IP address from anX-Forwarded-For (XFF) header field of an HTTP request message (which mayidentify an originating source of the message when the traffic is beingpassed via an intermediate proxy or load balancer), etc. In thisexample, the source IP address of the traffic 130A (i.e., 6.6.6.6) isfound to exist within the second set of botnet sources. Accordingly, itis likely that a botnet attack from that botnet (e.g., botnet 104A) isbeginning.

In response, at circle ‘6’, the TMM 104 can “activate” one or moreprotection measures for any additional traffic that may be received fromany of the source identifiers in that second set—i.e., 2.2.2.2, 4.4.4.4,6.6.6.6, and so on. Thus, upon a receipt (e.g., a short time later) ofmalicious traffic 130B from client end station 120B (using a source IPof 4.4.4.4) at circle ‘7’, the TMM 104 can immediately perform theactivated protection measure for the traffic 130B (at circle ‘8’, suchas “dropping” the traffic by not forwarding it on to its intendeddestination), potentially even before performing any other securityanalysis of the traffic. Accordingly, in some embodiments, a potentiallylarge amount of traffic that may arrive from a botnet in a potentiallyshort amount of time can be quickly managed (e.g., dispensed with), thusenabling the TMM 104 to more easily accommodate the additional load fromthe attack and likely preserve resources for continuing to processnon-malicious traffic destined for the server(s) 111—whether they aretargeted by the botnet or not.

Notably, in some embodiments, when the source of the malicious traffic130A (in the example, 6.6.6.6) exists within multiple sets of botnetsources, embodiments may “activate” protection measures for all of thesebotnets. In some embodiments, these protection measures may be activatedfor different amounts of time based upon the characteristics of theparticular involved botnets, such as the average or maximum length oftime observed for attacks from those particular botnets.

In some embodiments, at the expiration of a time period, the activatedprotection measures can be disabled. The time period can be a constantvalue (e.g., 1 minute, 5 minutes, 10 minutes, 20 minutes, 1 hour, etc.),which may be different based upon the particular botnet. For example, insome embodiments the length of the time period can be based uponpreviously-detected activity of that botnet, and could be based upon anaverage attack length of time observed from that botnet, a maximumattack length of time observed from that botnet, etc.

Moreover, in some embodiments the time period may continue indefinitelyuntil a condition is satisfied. For example, a condition may beconfigured such that the condition is met when no traffic is observedfrom any of the sources within the particular botnet for a thresholdperiod of time (e.g., 5 minutes, 15 minutes, 1 hour, etc.).

As described above with regard to circle ‘4’, the TMM 104 may receivemalicious traffic 130A and analyze the traffic 130A to determine that itis malicious. In some embodiments, this analysis may be based upon oneor more packets arriving from one particular client end station (e.g.,120A).

However, in some embodiments the analysis can be expanded to be basedupon traffic from multiple client end stations. For example, a securityrule could be configured to watch for a number of occurrences of aparticular pattern within traffic within an amount of time (e.g., when Xpackets are received within Y seconds that include a particularcharacter Z). As described above, this security rule could be applied toone particular source, and thus trigger when one source, for example,sends X packets within Y seconds that include a particular character Z.In that case, the TMM 104 can activate protection measures against allsources within a shared set of botnet sources that includes thetransmitting entity. However, in some embodiments the security rulecould also or alternatively be triggered when the condition is met dueto traffic from multiple sources within a same set of botnet sources(i.e., within a same botnet). Thus, in some embodiments, the conditioncan be satisfied when two or more sources within a set of botnetsources—but potentially not any of them individually—satisfies thecondition. For example, the rule could be triggered (and the protectionmeasures activated for the botnet), when a rule requires that 10particular packets are received, and a first client (in the botnet)sends 5 such packets and a second client (also in the same botnet) sends5 such packets. Accordingly, the security rule can look at traffic overtime from multiple members of a botnet, which can make this protectionscheme more granular that watching an entire botnet, but morecomprehensive than just watching one particular source.

In some embodiments, both botnet member identification and targetedbotnet protection techniques can be utilized together. For example, FIG.2 is a flow diagram illustrating operations 200 for botnet memberidentification and targeted botnet protection according to someembodiments.

The operations 200 include, at block 205, identifying members of one ormore botnets based upon network traffic observed over time, whichincludes identifying a plurality of source identifiers (e.g., IPaddresses) of end stations acting as part of each botnet.

The operations also include, at block 210, when traffic identified asmalicious is received from one of the source identifiers of one of thebotnets, blocking all traffic from all members of that botnet for anamount of time.

FIG. 3 is a flow diagram illustrating exemplary operations 300 forbotnet member identification according to some embodiments. Theseoperations 300 can be a part of block 205 shown in FIG. 2.

In some embodiments, the operations 300 include at block 305 observingincoming requests to one or more web applications at one or more sitesfor an amount of time, and at block 310, identifying a subset of theobserved incoming requests as being part of a malicious attack. Theoperations 300 can also include at block 315, creating, for each of theidentified malicious requests, an event data structure. The event datastructure can include a unique identifier of the request's source, aunique identifier of the request's destination, and an identifier of atype of the malicious attack of the request. In some embodiments, blocks305 and 310 and 315 may be performed by the TMM 104, though one or moreof these blocks could also be performed by the BIM 106.

These operations are further illustrated at 405 of FIG. 4, which is ablock diagram 400 illustrating botnet member identification conceptsaccording to some embodiments.

At block 320, the events are split into separate time period groupingsbased upon the time of each event.

Then, for each time period (330), the operations include identifyingbehavior similarity between traffic sources of the malicious requests(using the event data structures) at block 335.

In some embodiments, block 335 includes blocks 340-370. At block 340,events of a same attack type are selected, and at block 345 a similarityscore is calculated between each pair of traffic sources. In someembodiments, calculating a similarity score includes representingselected events as a graph of sources connected to targets (350) andapplying a similarity algorithm for vertices' similarity based upongraph (355). As an example, see illustration 410 of FIG. 4.

At block 360, the sources can be clustered based upon the similarityscores. Block 360 in some embodiments includes assigning each source toits own cluster (365), and iteratively merging clusters of the nexttop-similarity pair of sources until the similarity of the next-examinedtop-similarity pair is below a threshold value (370). As an example, seeillustration 415 of FIG. 4.

At block 375, associations are determined between sets of sources thathave a threshold amount of members (or, “many” members) that persistedover a threshold amount of time (or, a “long” amount of time). In someembodiments, block 375 includes creating an attacking-clusters graph(380) (as an example, see illustration 420 of FIG. 4), and finding (385)all paths that contain only edges with a minimal weight, that passthrough vertices with a minimal weight, and have a length (e.g., numberof edges) larger than a threshold amount of edges. This can result witheach path being a botnet “candidate”—i.e., each path may be a set ofbotnet sources, subject to further processing.

For example, optionally at block 390, in some embodiments furtherprocessing may be performed where sources can be removed from the pathsthat belong to a list of whitelisted sources. For example, in someembodiments the sources associated with known Content DistributionNetworks (CDNs), search engines, known scanning services, etc., can beremoved from the paths (lists) of botnet sources, as blocking trafficfrom these sources—regardless of whether some of it may bemalicious—could be problematic to the operation of the protectedserver(s) 111.

In some embodiments, blocks 320-395 may be performed by the BIM 106,though in other embodiments some or all of these blocks could beperformed by other modules.

FIG. 5 is a flow diagram illustrating exemplary operations 500 fortargeted botnet protection according to some embodiments. In someembodiments, the operations 500 may be for block 210 of FIG. 2, i.e.,when traffic identified as malicious is received from one of the sourceidentifiers of one of the botnets, block all traffic from all members ofthat botnet for an amount of time. In some embodiments, some or all ofthese operations 500 may be performed by the TMM 104 described herein.

The operations 500 can include, at block 505, receiving one or more setsof botnet sources, where each set includes a plurality of source IPaddresses of a botnet. Then, at block 510, traffic can be received froman IP address of one of the botnets (e.g., is identified within at leastone of the sets of botnet sources) that is destined to a server.

In some embodiments, at block 515 upon determining that the traffic ismalicious, the operations 500 can include performing a protective actionwith regard to the traffic, such as “blocking” it from being forwardedto the server, subjecting it to additional analysis, notifying a user orprocess, assigning it a lower or different processing priority value,etc. Additionally, 515 can include enabling a botnet security measure tobe utilized against any traffic received from any of the source IPaddresses belonging to the botnet (of which the source IP of receivedtraffic belongs to) for a period of time. This can include, in someembodiments, subjecting such traffic to the same protective action thathas been performed with regard to the traffic (e.g., blocking it),though it could include performing different actions. In someembodiments, optionally the “period of time” for enabling the securitymeasure can be based upon a determined duration of attack involving thatparticular botnet, and could be based upon an average or maximumduration of attack involving that particular botnet.

Optionally, the operations 500 also include blocks 520, 525, and 530. Atblock 520, during the period of time in which the botnet securitymeasure is activated, traffic is received from another IP address of theone botnet. At block 525, the protective action is performed against thetraffic, due to the traffic being originated by a member of the samebotnet.

At some point, at block 530, the botnet security measure can be disabledfor the botnet. In some embodiments, the disabling occurs responsive toan expiration of a timer, and in some embodiments, the disabling occursresponsive to not receiving any traffic from any IP of the botnet for athreshold amount of time.

Exemplary Deployment Environment

As described herein, the various involved components can be deployed invarious configurations for various purposes. For example, FIG. 6 is ablock diagram illustrating an exemplary on premise deploymentenvironment for a TMM 104 and/or BIM 106 according to some embodiments.

Specifically, FIG. 6 illustrates the TMM 104 implemented in a securitygateway 602 (which can be an enterprise security gateway) coupledbetween servers 111 and client end stations 120A-120N. Thus, access tothe servers 111 can be thought of as being “protected” by the securitygateway 602, as most (or all) desired interactions with any of theservers 111 will flow through the security gateway 602.

Security gateways—such as firewalls, database firewalls, file systemfirewalls, and web application firewalls (WAFs)—are network securitysystems that protect software applications (e.g., web applicationservers 616) executing on electronic devices (e.g., server end stations660) within a network (e.g., enterprise network 610) by controlling theflow of network traffic passing through the security gateway. Byanalyzing packets flowing through the security gateway and determiningwhether those packets should be allowed to continue traveling throughthe network, the security gateway can prevent malicious traffic fromreaching a protected server, modify the malicious traffic, and/or createan alert to trigger another responsive event or notify a user of thedetection of the malicious traffic.

In some embodiments, the security gateway 602 is communicatively coupledbetween the client end stations (120A-120N) and the server end stations660, such that all traffic (or a defined subset of traffic) destined tothe server end stations 660 is first passed through (or made availableto) the security gateway 602 for analysis. In some embodiments, part ofthe analysis is performed by the TMM 104 based upon one or moreconfigured security rules 650.

In some embodiments, the security gateway 602 executes as part of aseparate server end station 630B or a (dedicated or shared) networkdevice 630A; but in other embodiments, the security gateway 602 canoperate as part of server end stations 660 (for example, as a softwaremodule), or can be implemented using or another type of electronicdevice and can be software, hardware, or a combination of both.

As used herein, a network device (e.g., a router, switch, bridge) is anelectronic device that is a piece of networking equipment, includinghardware and software, which communicatively interconnects otherequipment on the network (e.g., other network devices, end stations).Some network devices are “multiple services network devices” thatprovide support for multiple networking functions (e.g., routing,bridging, switching), and/or provide support for multiple applicationservices (e.g., data, voice, and video).

Security gateways are sometimes deployed as transparent inline bridges,routers, or transparent proxies. A security gateway deployed as atransparent inline bridge, transparent router, or transparent proxy isplaced inline between clients (the originating client end station of thetraffic 601) and servers (e.g., server(s) 111) and is “transparent” toboth the clients and servers (the clients and the servers are not awareof the IP address of the security gateway, and thus the security gatewayis not an apparent endpoint). Thus, packets sent between the clients andthe servers will pass through the security gateway (e.g., arrive at thesecurity gateway, be analyzed by the security gateway, and may beblocked or forwarded on to the server when the packets are deemedacceptable by the security gateway).

Additionally, security gateways can also be deployed as a reverse proxyor non-inline sniffer (which may be coupled to a switch or other networkdevice forwarding network traffic between the client end stations(120A-120N) and the server end stations 660).

In this depicted embodiment, the security gateway 602 and the server endstation(s) 660 are illustrated as being within an enterprise network610, which can include one or more LANs. An enterprise is a business,organization, governmental body, or other collective body utilizing orproviding content and/or services.

In FIG. 6, a set of one or more server end stations 660 execute orotherwise implement one or more servers providing the content and/orservices. In the embodiment depicted in this figure, the servers 111include a database server 612, a file server 614, a web applicationserver 616, and a mail server 620, though in other embodiments the setof server end stations 660 implement other types of servers, includingbut not limited to print servers, gaming servers, application servers,etc.

A web application server 616 is system software (running on top of anoperating system) executed by server hardware (e.g., server end stations660) upon which web applications (e.g., web application 618) run. Webapplication servers 616 may include a web server (e.g. Apache,Microsoft® Internet Information Server (IIS), nginx, lighttpd) thatdelivers web pages (or other content) upon the request of HTTP clients(i.e., software executing on an end station) using the HTTP protocol.Web application servers 616 can also include an application server thatexecutes procedures (i.e., programs, routines, scripts) of a webapplication 618. Web application servers 616 typically include webserver connectors, computer programming language libraries, runtimelibraries, database connectors, and/or the administration code needed todeploy, configure, manage, and connect these components. Webapplications 618 are computer software applications made up of one ormore files including computer code that run on top of web applicationservers 616 and are written in a language the web application server 616supports. Web applications 618 are typically designed to interact withHTTP clients by dynamically generating HyperText Markup Language (HTML)and other content responsive to HTTP request messages sent by those HTTPclients. HTTP clients (e.g., non-illustrated software of any of clientend stations 120A-120N) typically interact with web applications bytransmitting HTTP request messages to web application servers 616, whichexecute portions of web applications 618 and return web application datain the form of HTTP response messages back to the HTTP clients, wherethe web application data can be rendered using a web browser. Thus, HTTPfunctions as a request-response protocol in a client-server computingmodel, where the web application servers 616 typically act as the“server” and the HTTP clients typically act as the “client.”

HTTP Resources are identified and located on a network by UniformResource Identifiers (URIs)—or, more specifically, Uniform ResourceLocators (URLs)—using the HTTP or HTTP Secure (HTTPS) URI schemes. URLsare specific strings of characters that identify a particular referenceavailable using the Internet. URLs typically contain a protocolidentifier or scheme name (e.g. http/https/ftp), a colon, two slashes,and one or more of user credentials, server name, domain name, IPaddress, port, resource path, query string, and fragment identifier,which may be separated by periods and/or slashes. The original versionsof HTTP—HTTP/0.9 and HTTP/1.0—were revised in Internet Engineering TaskForce (IETF) Request for Comments (RFC) 2616 as HTTP/1.1, which is incommon use today. A new version of the HTTP protocol, HTTP/2, is basedupon the SPDY protocol and improves how transmitted data is framed andtransported between clients and servers.

Database servers 612 are computer programs that provide databaseservices to other computer programs or computers, typically adhering tothe client-server model of communication. Many web applications 618utilize database servers 612 (e.g., relational databases such asPostgreSQL, MySQL, and Oracle, and non-relational databases, also knownas NoSQL databases, such as MongoDB, Riak, CouchDB, Apache Cassandra,and HBase) to store information received from HTTP clients and/orinformation to be displayed to HTTP clients. However, other non-webapplications may also utilize database servers 612, including but notlimited to accounting software, other business software, or researchsoftware. Further, some applications allow for users to perform ad-hocor defined queries (often using Structured Query Language or “SQL”)using the database server 612. Database servers 612 typically store datausing one or more databases, each including one or more tables(traditionally and formally referred to as “relations”), which areledger-style (or spreadsheet-style) data structures including columns(often deemed “attributes”, or “attribute names”) and rows (often deemed“tuples”) of data (“values” or “attribute values”) adhering to anydefined data types for each column. Thus, in some instances a databaseserver 612 can receive a SQL query from a client (directly from a clientprocess or client end station using a database protocol, or indirectlyvia a web application server that a client is interacting with), executethe SQL query using data stored in the set of one or more databasetables of one or more of the databases, and may potentially return aresult (e.g., an indication of success, a value, one or more tuples,etc.).

A file server 614 is system software (e g , running on top of anoperating system, or as part of an operating system itself) typicallyexecuted by one or more server end stations 660 (each coupled to orincluding one or more storage devices) that allows applications orclient end stations access to a file-system and/or files (e.g.,enterprise data), typically allowing for the opening of files, readingof files, writing to files, and/or closing of files over a network.Further, while some file servers 614 provide file-level access tostorage, other file servers 614 may provide block-level access tostorage. File servers 614 typically operate using any number of remotefile-system access protocols, which allow client processes to accessand/or manipulate remote files from across the Internet or within a sameenterprise network (e.g., a corporate Intranet). Examples of remotefile-system access protocols include, but are not limited to, NetworkFile System (NFS), WebNFS, Server Message Block (SMB)/Common InternetFile System (CIFS), File Transfer Protocol (FTP), Web DistributedAuthoring and Versioning (WebDAV), Apple Filing Protocol (AFP), RemoteFile System (RFS), etc. Another type of remote-file system accessprotocol is provided by Microsoft Sharepoint (TM), which is a webapplication platform providing content management and document and filemanagement.

A mail server 620 (or messaging server, message transfer agent, mailrelay, etc.) is system software (running on top of an operating system)executed by server hardware (e.g., server end stations 660) that cantransfer electronic messages (e.g., electronic mail) from one computingdevice to another using a client—server application architecture. Manymail servers 620 may implement and utilize the Simple Mail TransferProtocol (SMTP), and may utilize the Post Office Protocol (POP3) and/orthe Internet Message Access Protocol (IMAP), although many proprietarysystems also exist. Many mail servers 620 also offer a web interface(e.g., as a web application 618) for reading and sending email.

The illustrated exemplary deployment also illustrates a variety ofconfigurations for implementing a BIM 106. A first deploymentpossibility (BIM 106A) is as a module of the security gateway 602.Another deployment possibility (BIM 106B) is as a module executed uponthe server end station(s) 660, while yet another deployment possibility(BIM 106C) is a module executed in a cloud computing system 664. In someembodiments, the BIM 106 is communicatively coupled with the TMM 104,and thus can be located in a variety of locations able to provide suchconnectivity.

Another deployment possibility is illustrated in FIG. 7, which is ablock diagram illustrating an exemplary cloud-based deploymentenvironment 700 for a TMM and/or BIM according to some embodiments.

FIG. 7 again illustrates servers 111, a TMM 104, various deployments ofa BIM 106, and client end station(s) 120A-120N. However, in thisdepicted embodiment, the servers 111 (and possibly BIM 106B) can beprovided as cloud services 710 of one or more third-party server endstations 720 of, for example, a cloud computing system 732.

Additionally, the TMM 104 (and possibly BIM 106A) can be provided in acloud security gateway 702 operating in a cloud computing system 730,which can be different than cloud computing system 732 or possibly eventhe same. Regardless, the path 725 from the client end station(s)120A-120N to the servers 111 necessarily flows through the TMM 104, eventhough it may not be in a same cloud computing system 732 as the servers111. One example of a cloud security gateway 702 is the Imperva (TM)Skyfence (TM) Cloud Gateway from Imperva, Inc.

Alternatively, though not illustrated, the TMM 104 may not lie in thepath 725 between the client end stations 120A-120N and the servers 111,and instead may gain access to network traffic through a channel betweenthe TMM 104 and the servers 111 for this purpose. For example, the TMM104 can be configured to “monitor” or “poll” the cloud service(s) 710 bytransmitting requests to the third-party server end stations (orindividual servers, such as web application server 616) as part of amonitoring scheme to obtain network traffic. This monitoring can occuraccording to a defined schedule, such as checking once every fewminutes. Additionally or alternatively, the server(s) 111 can beconfigured to “report” some or all traffic (or summaries thereof, eventdata structures, etc.) to the TMM 104. For example, in some embodimentsthe server(s) 111 can be configured to transmit data to the TMM 104using an Application Programming Interface (API) call, Short MessageService (SMS) message, email message, etc.

FIG. 8 is a block diagram illustrating exemplary operations 800including malicious event identification for botnet memberidentification according to some embodiments. The operations depicted inFIG. 8 and subsequent FIGS. 9-11 are provided to further illustrate onepossible set of operations corresponding to certain operations depictedin FIG. 3 and/or FIG. 4. In some embodiments, these operations of any orall of FIGS. 8-11 can be performed by the BIM 106 of FIG. 1, 6, or 7.

In some embodiments, a botnet member identification procedure caninclude obtaining a set of requests 805 originated by one or more endstations (e.g., client end stations, server end stations) and destinedto one or more servers (e.g., servers 111). As described herein, thisobtaining could include receiving traffic data 108 from one or more TMMs104 (e.g., as each request is received, according to a schedule,on-demand, etc.), and these one or more TMMs 104 could be at a same ordifferent site—for example, the traffic data 108 could be from oneorganization or from multiple organizations. As another example, theobtaining of the set of requests 805 could occur via obtaining, by theBIM 106, data from access logs of the server(s) 111, and identifyingrequests 805 from within this data. For example, the BIM 106 couldrequest access log data from the server(s) 111 (or server end station(s)110) and then it would be transmitted back to the BIM 106 in response,or the server(s) 111/server end station(s) 110 could otherwise providethe access log data, e.g., according to a schedule. Then, according tothe type of server 111 and/or the type of logs, requests can beidentified. This set of operations for obtaining or “collecting” the setof requests 805 can, in some embodiments, be part of block 305 of FIG.3—i.e., observing incoming requests to one or more web applications atone or more sites for an amount of time.

Next, from the collected requests 805, a set of malicious requests 815can be identified based upon applying a set of security rules to the setof collected requests 805. Numerous types of security rules fordetecting malicious attacks are well-known to those of skill in the artand can be used in various embodiments, and may include searching forthe existence (or non-existence) of a particular character, set ofcharacters, pattern, etc., within one or multiple portions (e.g., withinheaders and/or payloads) of one or multiple requests.

As one example, a rule can be configured to detect a “malformed”Content-Length header (of a HTTP request message) that has a negativevalue, as one attack that has been observed includes attackers providingnegative values in this field instead of an anticipated, non-negativeinteger value. Thus, one or more of the collected requests 805 can beanalyzed to determine if any include a negative integer value (oranother type of non-anticipated type of value), and if such a request isfound, it can be included in the set of malicious requests 815. Invarious embodiments the number of rules and/or attack “coverage” of theset of rules can differ according to the types of server(s) involved,the amount of scrutiny required for the deployment, the amount ofprocessing resources available, etc. Thus, in some embodiments, themalicious requests 815 could include requests 810 that are part of avolumetric (or “volume-based”) attack, protocol attack, applicationlayer attack, etc.

In some embodiments, this set of operations for identifying maliciousrequests 815 may be part of block 310 of FIG. 3—i.e., identifying asubset of the observed incoming requests 805 as being part of amalicious attack.

For each of the malicious requests 815, an event structure 820 can begenerated. As illustrated, each event structure 820 includes a sourceidentifier (S1, S2, et seq.) of the source of the corresponding requestmessage, which can comprise a complete or partial source InternetProtocol (IP) address (v4 or v6), or another identifier that uniquelycorresponds to a particular source. FIG. 8 also shows each eventstructure 820 including a destination identifier (D1, D2, et seq.) ofthe destination (e.g., server) of the corresponding request message,which can comprise a complete or partial source Internet Protocol (IP)address (v4 or v6), a hostname, or another identifier that uniquelycorresponds to a particular destination. Each event structure 820illustrated also includes an attack type indicator (AT1, AT2, et seq.)that uniquely identifies one (or more) attack type of the correspondingrequest message. As one simple example, upon the security rule describedabove (looking for a negative integer in a Content-Length header) beingmet, an identifier of that particular rule (e.g., rule #1) or attack(e.g., a Malformed Content-Length attack, which could be found via oneor more multiple rules, is attack #3) can be placed within the eventstructure 820. Additionally, the depicted event structures 820 alsoinclude a time (TIME A, TIME B, et seq.) associated with therequest—e.g., the time when the request was received/observed/logged bya TMM 105, security gateway 102, server end station 110, server 111,etc. This time could be in a variety of formats/representations,including a raw or converted timestamp, an identifier of a period oftime (which hour, 10 minute window, etc.) of the request, etc.

Although four types of data are shown within an event structure 820 andwill be used to continue the example, it is to be understood that thenumber(s) and type(s) of these elements can be different in differentembodiments—thus, this combination is merely exemplary.

In some embodiments, this set of operations for generating eventstructures 820 may be part of block 315 of FIG. 3—i.e., creating, foreach of the identified malicious requests, an event data structure.

In some embodiments, the event structures 820 can be divided into timeperiods (e.g., time period ‘A’ 825A, time period ‘B’ 825B, and so on).The size of the time period can be configured differently depending uponthe preferences of the implementer and the types of attacks currentlyused by attackers, and can be tuned over time to adjust for best resultsfor a particular implementation. However, in general, the size of eachtime period should be large enough to allow for evidence of an ongoing,continued attack to be observed in successive time periods, though thesize of each time period should be small enough to avoid the processing(described below) for each time period becoming impractical. Forexample, in some embodiments, the size of each time period is oneminute, though in other embodiments the size of each time period couldbe thirty seconds, two minutes, five minutes, ten minutes, thirtyminutes, one hour, etc.

This “division” of the event structures 820 into multiple time periods825 can occur as a distinct operation, and can include placing thoseevent structures in a same time period in a memory or storage locationin adjacent physical or virtual locations. However, in some embodiments,the division of the event structures 820 may include labeling (orupdating) each event structure 820 with a time period identifier, and insome embodiments, the division may occur iteratively—e.g., the eventstructures can be iterated over one or more multiple times to gathertime period-relevant event structures in an on-demand fashion. Forexample, in some embodiments each event structure can be arecord/document stored a database, and the division can occur byquerying the database for event structures having a “time” within arange of times corresponding to a particular time period. Of course,many other techniques for dividing event structures into time periodscan be utilized and discerned by those of ordinary skill in the art.

In some embodiments, this set of operations for dividing eventstructures into time periods may be part of block 320 of FIG. 3—i.e.,the events are split into separate time period groupings based upon thetime of each event.

We now turn to FIG. 9, which is a block diagram illustrating exemplaryoperations 900 including traffic source similarity determination forbotnet member identification, which can be performed after theoperations of FIG. 8, according to some embodiments.

These depicted operations 900 can be performed for each of the timeperiods in which the event structures have been divided into, as shownin FIG. 8, which can correspond to block 330 of FIG. 3.

Thus, in some embodiments, the event structures (corresponding to“events”) of a time period having a same attack type 905 can beidentified, which can correspond to block 340 of FIG. 3—i.e., events ofa same attack type are selected. This selection can, in someembodiments, be based upon the attack type indicator data of each eventstructure (shown here as “AT1”).

Using these selected events having a same attack type, in someembodiments a source-target graph 910 can be constructed, which can be agraph of the sources (of the traffic) connected to the targets (ordestinations of the traffic). In this depicted example, the events withan attack type 905 of “AT1” have three different sources—S1, S2, andS3—and these events have four different targets—D1, D2, D4, and D5.Thus, in some embodiments a vertex (or node) is created for each trafficsource and a vertex is created for each traffic target/destination, andedges (or “arrows”, which can be directed) can be inserted between thoseof the sources and targets that have a corresponding event with a sameattack type 905. In this example, as there are three events of a sameattack type 905 from source S1, and these events are destined to targetsD1, D4, and D2, the source-target graph 910 includes three edges leadingfrom S1 to D1, D2, and D4, respectively. In some embodiments, thesesource-target graph 910 construction operations may be part of block 350of FIG. 3—i.e., representing selected events as a graph of sourcesconnected to targets.

With this source-target graph 910, in some embodiments a similarityalgorithm 915 can be applied (or executed) to determine the similaritybetween the source vertices of the graph. A variety of such similarityalgorithms are known to those of skill in the art, and one suchsimilarly algorithm is illustrated here in FIG. 9. This exemplarysimilarity algorithm 915 includes determining a similarity score foreach pair of sources in the graph 910, and includes dividing the numberof common targets (for a considered pair of sources) and the totalnumber of different targets (for the same considered pair of sources).Thus, in this example, the similarity score for S1 and S2 can be theresult of 2 (as sources S1 and S2 both are connected to targets D1 andD4) divided by 3 (as sources S1 and S2 collectively target D1, D2, andD4). This result of ⅔ yields a similarity score of 0.66 for the (S1, S2)pair. In some embodiments, a similarity score can be computed for eachsuch combination of sources. These operations involving applying asimilarity algorithm can be part of block 355 of FIG. 3—i.e., applying asimilarity algorithm for the vertices' similarity based upon the graph.

This combination of source-target graph 910 construction and similarityscoring (e.g., using similarity algorithm 915) can be part of block 345of FIG. 3, and can be performed for each of the different groupings ofevents having a same attack type 905, and can be performed for each timeperiod (e.g., time periods 825A-825B) being considered.

Continuing on, FIG. 10 is a block diagram illustrating exemplaryoperations 1000 including periodic-source cluster generation for botnetmember identification, which can be performed after the operations ofFIG. 9, according to some embodiments. Using the generated similarityscores (e.g., example similarity scores 1005)—for a time period for agrouping of event structures having a same attack type—the sources canbe clustered 360. For example, in some embodiments each source reflectedin the example similarity scores 1005 may be initially placed into itsown cluster, which can be part of block 365 of FIG. 3—i.e., assigningeach source to its own group or cluster.

Next, in some embodiments the sources can be iteratively combined (orconsolidated) based upon the similarity scores, which can be part ofblock 370 of FIG. 3. For example, the pair of sources having a largestsimilarity score can be combined. This combining can occur one or moretimes while one or more conditions are met. For example, in someembodiments the combining occurs as long as the next-highest similarityscore is greater than a threshold value (e.g., 0.5).

For ease of understanding, the exemplary six sources in FIG. 10 mayfirst be placed into separate clusters (which can correspond to block365 of FIG. 3), and the source pair having the largest unprocessedsimilarity score (of 0.66, belonging to the S1-S2 pair) can be mergedinto one cluster. This results in one cluster with S1 and S2, and fourother clusters corresponding to S3-S6. Next, the next source pair havingthe largest unprocessed similarity score (of 0.57, belonging to theS4-S5 pair) can be merged into one cluster. This results in fourclusters—(S1, S2), (S3), (S6), and (S4, S5). Again, the next source pairhaving the largest unprocessed similarity score (of 0.5, belonging tothe S1-S6 pair) can be merged into one cluster. In this case, the sourceS6 can be added into the cluster including S1 and S2, and thus, threeclusters remain—(S1, S2, S6), (S3), and (S4, S5).

Although the next source pair having the largest unprocessed similarityscore (0.33, of the S1-S4 pair) could be merged, in this example weassume that a merging condition exists, which indicates that mergingwill only occur for similarity scores that are greater than or equal to0.5. Thus, because 0.33 does not satisfy this criteria as it is lessthan 0.5, the merging stops, leaving a set of periodic-source clusters1010A-1010C. Of course, other rules can be configured for this mergingprocess, and thus, this illustrated scenario is exemplary. For example,rules can be utilized that indicate what happens when a source (in acluster with 1+other sources) is to be merged with another source (in adifferent cluster with 1+other sources), which could include merging allof these sources together into one cluster, stopping the mergingprocess, skipping that particular merge but continuing the mergingprocess, etc.

We continue with FIG. 11, which is a block diagram illustratingexemplary operations 1100 including attacking-clusters graph generationand botnet identification for botnet member identification, which can beperformed after the operations of FIG. 10, according to someembodiments.

With a set of periodic-source clusters (e.g., periodic-source clusters1010A-1010C generated in FIG. 10, shown as C1, C2, and C3) correspondingto events of a same attack type from each of the time periods underconsideration, an attacking-clusters graph 1110 can be generated. Thisgeneration can be part of block 380 of FIG. 3. For example, theperiodic-source clusters 1010A-1010C of time period “A” 825A can berepresented as a level in a graph, where each vertex represents one ofthe clusters and has a weight indicating the number of sources withinthe cluster. As an example, the first periodic-source cluster 1010Aincludes three sources (S1, S2, and S6), and thus can be represented asa vertex “C1” having a weight of 3. Each of the other periodic-sourceclusters 1010B-1010C can similarly be represented as vertices C2 and C3,having weights of 2 and 1 respectively. This attacking-clusters graph1110 construction can continue with generating additional levels foreach other time period under consideration—here, this is shown as timeperiods ‘B’ 825B and ‘C’ 825C, though of course in other embodimentsthere can be different numbers of time periods.

The attacking-clusters graph 1110 construction can also include theinsertion of edges between the vertices of different levels. Forexample, an edge can be inserted between clusters of adjacent levelsthat share members (i.e., have one or more common sources). In thisexample, we assume that cluster C1 (having S1, S2, and S6) shares allthree of its sources with cluster C4 of the second level (which, forexample, could represent sources S1, S2, S6, S8, S9, and S10). Thus, anedge can be inserted between C1 and C4, with a weight indicating anumber of common sources (3) between the two vertices.

In some embodiments, with a per-attack-type attacking-clusters graph1110, the operations 1100 can further include analyzing theattacking-clusters graph 1110 according to a condition 1115. In someembodiments, a condition 1115 comprises one or more logical testsindicating what paths through the attacking-clusters graph 1110 are tobe identified. For example, the condition 1115 shown herein providesthat path are to be identified that include only vertices having aweight of 2 or more, only edges having a weight of 2 or more, and have apath length (e.g., a number of traversed edges) of at least 2 edges. Inthis case, the condition 1115 is satisfied for two paths of theattacking-clusters graph 1110: C1-C4-C8 and C2-05-C8. These two pathscan thus indicate two botnet candidates, which are represented as botnetcandidate #1 1150A and botnet candidate #2 1150B. Each botnet candidate1150A-1150B is shown as including identifiers of the sources of thevertices traversed in the corresponding path. Thus, this set ofoperations involving utilizing a condition 1115 with theattacking-clusters graph 1110 to generate botnet candidates can be partof block 385 of FIG. 3—i.e., finding all paths that contain only edgeswith a minimal weight, that pass through vertices with a minimal weight,and have a length larger than a threshold amount of edges, resulting ineach path being a botnet “candidate” (in some embodiments, subject tofurther processing).

For example, in some embodiments, the operations 1100 may include, atcircle ‘A’, removing from the botnet candidates 1150A-1150B any sources(or, source identifiers) that exist in a set of identifiers ofwhitelisted sources 1120 (e.g., sources known to be part of CDNs, searchengines, scanning services). As illustrated, the sources S8 and S13 arein the set of identifiers of whitelisted sources, and source S8 is alsowithin botnet candidate #1 1150A. Thus, this source may be remove frombotnet candidate #1 1150A whereas botnet candidate #2 will be unchanged,resulting in the two sets of suspected botnet identifiers 1125A-1125B.These operations for the “filtering” of whitelisted sources may be partof block 390 of FIG. 3—i.e., sources can be removed from the paths thatbelong to a list of whitelisted sources. However, in some embodimentssuch source removal operations may not be performed, and thus the flowmay alternatively continue via circle ‘B’ to yield the two sets ofsuspected botnet identifiers 1125A-1125B, where the first botnet #11125A does include an identifier of source S8.

Exemplary Flows

FIG. 12 is a flow diagram illustrating exemplary operations 1200 forproviding targeted botnet protection according to some embodiments. Insome embodiments, operations 1200 can be performed by one or more TMMs104 disclosed herein. In these embodiments, the one or more TMMs 104 canbe implemented by one or more electronic devices, and each TMM 104 canbe deployed in front of the one or more servers in that the TMM 104receives all network traffic sent by a plurality of end stations that isdestined for the one or more servers.

In some embodiments, at block 1205 the operations 1200 include receivinga message including a plurality of identifiers that have been determinedto be used by a subset of the plurality of end stations collectivelyacting as a suspected botnet, where each of the plurality of identifiersis or is based upon a network address. The operations 1200 can alsoinclude, at block 1210, receiving, from a first of the plurality of endstations, a request message that is destined for one of the one or moreservers and that includes at least a first identifier of the pluralityof identifiers. The operations 1200 can also include, at block 1215,blocking the request message from being sent to the one serverresponsive to a determination that the request message is malicious, andat block 1220, responsive to the determination and a differentdetermination that the request message includes any of the plurality ofidentifiers in at least a set of one or more locations in the requestmessage, activating, for an amount of time, a protection mechanism thatapplies to all traffic that has any of the plurality of identifiers inany of the set of locations.

In some embodiments, the set of locations includes one or more of: asource IP address header field; a User-Agent header field; and anX-Forwarded-For header field.

In some embodiments, the protection mechanism comprises dropping alltraffic that has any of the plurality of identifiers in any of the setof locations regardless of whether it is separately determined to bemalicious. In some embodiments, the operations 1200 further includereceiving a second request message that is from the first end stationand that is destined to any one of the one or more servers; and allowingthe second request message to be forwarded toward its destinationdespite the second request message including the at least one of theplurality of identifiers that have been determined to be used by thesubset of end stations collectively acting as the suspected botnet dueto the protection mechanism no longer being activated.

In some embodiments, the protection mechanism comprises increasing anamount of security analysis performed with the traffic that has any ofthe plurality of identifiers in any of the set of locations.

According to some embodiments, the amount of time that the protectionmechanism is activated is specific to the suspected botnet. In someembodiments, the amount of time is based upon an average or maximumattack length of time determined based upon previous activity of thesuspected botnet.

In some embodiments, the amount of time is indefinite in that itcontinues until a condition is satisfied. In some embodiments, thecondition is satisfied upon a determination that no request messageshave been received (e.g., at the TMM 104) that include any of theplurality of identifiers in any of the set of locations for a thresholdamount of time.

In some embodiments, the operations 1200 further include receiving, froma second end station of the subset of end stations, a second requestmessage that is destined for a second server of the one or more serversand that includes at least one of the plurality of identifiers in one ofthe set of locations; and blocking, as part of the protection mechanismbefore an end of the amount of time, the second request message frombeing sent to the second server due to the protection mechanism beingactivated.

According to some embodiments, the received message that includes theplurality of identifiers further includes a second plurality ofidentifiers that have been determined to be used by a second subset ofthe plurality of end stations collectively acting as a second suspectedbotnet; the first identifier exists in both the plurality of identifiersand the second plurality of identifiers; and the activated protectionmechanism further applies to all traffic that has any of the secondplurality of identifiers in any of the set of locations due to the firstidentifier also existing in the second plurality of identifiers.

In some embodiments, the operations 1200 further include receiving, froma second of the plurality of end stations, a second request message thatis destined to any of the one or more servers and that includes at leasta second identifier that exists within a second plurality of identifiersof a second suspected botnet but not within the first plurality ofidentifiers of the suspected botnet; and responsive at least in part dueto the second identifier not existing within the first plurality ofidentifiers, allowing the second request message to be forwarded towardits destination despite the protection mechanism being activated for thesuspected botnet and despite the second identifier belonging to thesecond plurality of identifiers of the second suspected botnet.

FIG. 13 is a flow diagram illustrating exemplary operations 1300 forproviding targeted botnet protection according to some embodiments. Insome embodiments, operations 1300 can be performed by one or more TMMs104 disclosed herein. In these embodiments, the one or more TMMs 104 canbe implemented by one or more electronic devices, and each TMM 104 canbe deployed in front of the one or more servers in that the TMM 104receives all network traffic sent by a plurality of end stations that isdestined for the one or more servers.

In some embodiments, at block 1305 the operations 1300 include receivinga message including a plurality of identifiers that have been determinedto be used by a subset of the plurality of end stations collectivelyacting as a suspected botnet, wherein each of the plurality ofidentifiers is or is based upon a network address.

In some embodiments, the operations 1300 include, at block 1310,receiving, from a plurality of end stations of the subset of endstations collective acting as the suspected botnet, a plurality ofrequest messages that are destined for a set of one or more of the oneor more servers, wherein each of the plurality of request messagesincludes at least one of the plurality of identifiers in at least a setof one or more locations in the request message.

In some embodiments, the operations 1300 include, at block 1315,responsive to a determination that the plurality of request messageseach include, in the set of locations, an identifier that is within theplurality of identifiers and further that these plurality of requestmessages collectively satisfy a security rule, activating, for an amountof time, a protection mechanism that applies to all traffic that has anyof the plurality of identifiers in any of the set of locations, whereinnone of the plurality of request messages individually would satisfy thesecurity rule.

In some embodiments, the security rule, to be satisfied, at leastrequires a defined amount of request messages that share a commoncharacteristic to be received within a period of time, wherein thedefined amount of request messages is greater than one. According tosome embodiments, the common characteristic is met when each of theplurality of request messages carries a payload representing an attemptto login to an application, wherein the payload includes a password, ausername, or both the password and username. In some embodiments, theoperations 1300 further include determining that each attempt to loginof each of the plurality of request messages was unsuccessful. In someembodiments, said determining that each attempt to login of theplurality of request messages was unsuccessful comprises: receiving aplurality of response messages that were originated by the set ofservers, wherein each response message indicates that the attempt tologin of a corresponding one of the plurality of request messages wasunsuccessful.

According to some embodiments, the set of locations includes one or moreof: a source IP address header field; a User-Agent header field; and anX-Forwarded-For header field.

According to some embodiments, the protection mechanism comprisesdropping all traffic that has any of the plurality of identifiers in anyof the set of locations regardless of whether it is separatelydetermined to be malicious.

According to some embodiments, the protection mechanism comprisesincreasing an amount of security analysis performed with the trafficthat has any of the plurality of identifiers in any of the set oflocations.

According to some embodiments, the amount of time that the protectionmechanism is activated is specific to the suspected botnet and is basedupon an average or maximum attack length of time determined based uponprevious activity of the suspected botnet.

According to some embodiments, the amount of time is indefinite in thatit continues until a condition is satisfied, wherein the condition issatisfied upon a determination that no request messages have beenreceived (e.g., at the TMM) that include any of the plurality ofidentifiers in any of the set of locations for a threshold amount oftime.

FIG. 14 is a flow diagram illustrating exemplary operations 1400 foridentifying a subset of a plurality of end stations that collectivelyact as a suspected botnet according to some embodiments. In someembodiments, operations 1400 can be performed by a BIM 106 disclosedherein. The BIM 106 can be implemented by an electronic device.

In some embodiments, the operations 1400 include, at block 1405,obtaining traffic data from one or more TMMs 104 implemented by one ormore electronic devices, wherein the traffic data includes or is basedupon a plurality of request messages that were originated by ones of theplurality of end stations and that were destined to one or more servers,wherein each of the one or more TMMs is deployed in front of at leastone of the one or more servers in that the TMM receives all networktraffic originated by the plurality of end stations that is destined forthe at least one server;

In some embodiments, the operations 1400 include, at block 1410,generating, based upon the obtained traffic data, a set of identifierscorresponding to the subset of the plurality of end stations that aredetermined by the BIM to be collectively acting as the suspected botnetin that they have transmitted request messages, destined for one or moreof the one or more servers, that collectively or individually satisfyone or more security rules which, when satisfied, indicate a maliciousattack, wherein the set of identifiers comprises a plurality ofidentifiers.

In some embodiments, the operations 1400 include, at block 1415,transmitting the set of identifiers to the one or more TMMs to cause theone or more TMMs to utilize the set of identifiers while analyzingsubsequent request messages destined to the one or more servers todetect an attack from the suspected botnet and to protect the one ormore servers from the attack.

In some embodiments, said generating the set of identifiers comprises:identifying, from the traffic data, a subset of the plurality of requestmessages that are malicious; and determining, based upon the subset ofrequest messages, that the subset of end stations have collectivelyperformed the malicious attack for at least a threshold amount of timeand that at least a threshold number of the subset of end stations havebeen involved in the malicious attack for each of a threshold number oftime periods within the threshold amount of time.

In some embodiments, said determining comprises: generating a pluralityof event data structures corresponding to the subset of requestmessages, wherein each of the plurality of event data structuresincludes a source identifier of a source of the corresponding requestmessage and a destination identifier of a destination of thecorresponding request message; identifying a plurality of groupings ofthe generated event data structures, wherein each of the plurality ofgroupings corresponds to a time period of a plurality of different timeperiods and includes those of the generated event data structurescorresponding to a request message that was received at a correspondingone of the one or more TMMs within the time period; and identifying, foreach of the different time periods, groupings of source identifiers ofthe request messages corresponding to the event data structures of thetime period, wherein generating the set of identifiers is based uponanalyzing the groupings of source identifiers of each of the differenttime periods.

In some embodiments, said identifying the groupings of sourceidentifiers for each of the different time periods comprises:calculating a similarity score between each pair of source identifiersof those of the event data structures of the time period that have asame attack type, wherein the similarity score is based upon thedestination identifiers of those event data structures that include oneof the pair of source identifiers; and clustering, based upon thesimilarity scores, the source identifiers of those of the event datastructures of the time period that have the same attack type.

In some embodiments, said generating the set of identifiers furthercomprises: removing, from the set of identifiers, any identifierexisting within a set of whitelisted source identifiers.

In some embodiments, the operations 1400 further include determining,based at least in part upon the obtained traffic data, an attackduration of the suspected botnet, wherein the attack duration is anaverage attack duration or a maximum attack duration observed over aplurality of attacks observed from the suspected botnet; andtransmitting the attack duration of the suspected botnet to the one ormore TMMs to cause the one or more TMMs to utilize the attack durationwhile protecting the one or more servers from the suspected botnet.

In some embodiments, each identifier of the set of identifiers comprisesan IP address.

Alternative Embodiments

The operations in the flow diagrams have been described with referenceto the exemplary embodiments of the other diagrams. However, it shouldbe understood that the operations of the flow diagrams can be performedby embodiments of the invention other than those discussed withreference to these other diagrams, and the embodiments of the inventiondiscussed with reference these other diagrams can perform operationsdifferent than those discussed with reference to the flow diagrams.

Similarly, while the flow diagrams in the figures show a particularorder of operations performed by certain embodiments of the invention,it should be understood that such order is exemplary (e.g., alternativeembodiments may perform the operations in a different order, combinecertain operations, overlap certain operations, etc.).

While the invention has been described in terms of several embodiments,those skilled in the art will recognize that the invention is notlimited to the embodiments described, can be practiced with modificationand alteration within the spirit and scope of the appended claims. Thedescription is thus to be regarded as illustrative instead of limiting.

What is claimed is:
 1. A method in a traffic monitoring module (TMM)that is implemented by an electronic device and that is for providingtargeted botnet protection for one or more servers, wherein the TMM isdeployed in front of the one or more servers in that the TMM receivesnetwork traffic sent by a plurality of end stations that is destined forthe one or more servers, the method comprising: receiving, at the TMM, amessage including a first plurality of identifiers that have beendetermined by a botnet identification module to be used by a subset ofthe plurality of end stations collectively acting as a first suspectedbotnet; receiving, at the TMM from a first of the plurality of endstations, a first request message that is destined for one of the one ormore servers and that includes at least a first identifier of the firstplurality of identifiers; allowing the first request message to be sentto its destination despite the first identifier existing within thefirst plurality of identifiers; receiving, at the TMM from a second ofthe plurality of end stations, a second request message that is destinedfor one of the one or more servers and that includes at least a secondidentifier that exists within the first plurality of identifiers;blocking, at the TMM, the second request message from being sent to itsdestination responsive to a determination that the second requestmessage is malicious; and responsive to the determination that thesecond request message is malicious and a different determination thatthe second identifier included in the second request message existswithin the first plurality of identifiers, activating, by the TMM for anamount of time, a protection mechanism that applies to all traffic thathas any of the first plurality of identifiers including the firstidentifier and the second identifier, wherein the first identifier andthe second identifier are IP addresses having different subnets.
 2. Themethod of claim 1, wherein the first request message includes one ormore of the first plurality of identifiers in at least a set of one ormore locations in the first request message, and wherein the set of oneor more locations includes one or more of: a source Internet Protocol(IP) address header field; a User-Agent header field; and anX-Forwarded-For header field.
 3. The method of claim 1, wherein theprotection mechanism that applies to all traffic that has any of thefirst plurality of identifiers comprises dropping all traffic that hasany of the first plurality of identifiers regardless of whether it isseparately determined to be malicious.
 4. The method of claim 3, furthercomprising: receiving, at the TMM from the first of the plurality of endstations, a third request message that is destined for one of the one ormore servers; and allowing the third request message to be sent to itsdestination despite the third request message including at least one ofthe first plurality of identifiers due to the protection mechanism nolonger being activated for the first suspected botnet.
 5. The method ofclaim 1, wherein the protection mechanism that applies to all trafficthat has any of the first plurality of identifiers comprises increasingan amount of security analysis performed on the traffic that has any ofthe first plurality of identifiers.
 6. The method of claim 1, whereinthe amount of time is specific to the first suspected botnet.
 7. Themethod of claim 6, wherein the amount of time is based upon an averageor maximum attack length of time determined based upon previous activityof the first suspected botnet.
 8. The method of claim 1, wherein theamount of time is indefinite in that it continues until a condition issatisfied.
 9. The method of claim 8, wherein the condition is satisfiedupon a determination, by the TMM, that no request messages have beenreceived at the TMM that include any of the first plurality ofidentifiers for a threshold amount of time.
 10. The method of claim 1,further comprising: receiving, at the TMM from a third of the pluralityof end stations, a third request message that is destined for one of theone or more servers and that includes at least one of the firstplurality of identifiers; and blocking, at the TMM as part of theprotection mechanism before an end of the amount of time, the thirdrequest message from being sent to its destination due to the protectionmechanism being activated.
 11. The method of claim 1, wherein: thereceived message that includes the first plurality of identifiersfurther includes a second plurality of identifiers that have beendetermined to be used by a subset of the plurality of end stationscollectively acting as a second suspected botnet; the second identifierexists within both the first plurality of identifiers and the secondplurality of identifiers; and the activated protection mechanism furtherapplies to all traffic that has any of the second plurality ofidentifiers due to the second identifier also existing within the secondplurality of identifiers.
 12. A non-transitory computer readable storagemedium having instructions which, when executed by one or moreprocessors of an electronic device, causes the electronic device toimplement a traffic monitoring module (TMM) that is to performoperations for providing targeted botnet protection for one or moreservers, wherein the TMM is to be deployed in front of the one or moreservers in that the TMM receives network traffic sent by a plurality ofend stations that is destined for the one or more servers, theoperations comprising: receiving, at the TMM, a message including afirst plurality of identifiers that have been determined by a botnetidentification module to be used by a subset of the plurality of endstations collectively acting as a first suspected botnet; receiving, atthe TMM from a first of the plurality of end stations, a first requestmessage that is destined for one of the one or more servers and thatincludes at least a first identifier of the first plurality ofidentifiers; allowing the first request message to be sent to itsdestination despite the first identifier existing within the firstplurality of identifiers; receiving, at the TMM from a second of theplurality of end stations, a second request message that is destined forone of the one or more servers and that includes at least a secondidentifier that exists within the first plurality of identifiers;blocking, at the TMM, the second request message from being sent to itsdestination responsive to a determination that the second requestmessage is malicious; and responsive to the determination that thesecond request message is malicious and a different determination thatthe second identifier included in the second request message existswithin the first plurality of identifiers, activating, by the TMM for anamount of time, a protection mechanism that applies to all traffic thathas any of the first plurality of identifiers including the firstidentifier and the second identifier, wherein the first identifier andthe second identifier are IP addresses having different subnets.
 13. Thenon-transitory computer readable storage medium of claim 12, wherein thefirst request message includes one or more of the first plurality ofidentifiers in at least a set of one or more locations in the firstrequest message, and wherein the set of one or more locations includesone or more of: a source Internet Protocol (IP) address header field; aUser-Agent header field; and an X-Forwarded-For header field.
 14. Thenon-transitory computer readable storage medium of claim 12, wherein theprotection mechanism that applies to all traffic that has any of thefirst plurality of identifiers comprises dropping all traffic that hasany of the first plurality of identifiers regardless of whether it isseparately determined to be malicious.
 15. The non-transitory computerreadable storage medium of claim 14, wherein the operations furthercomprise: receiving, at the TMM from the first of the plurality of endstations, a third request message that is destined for one of the one ormore servers; and allowing the third request message to be sent to itsdestination despite the third request message including at least one ofthe first plurality of identifiers due to the protection mechanism nolonger being activated for the first suspected botnet.
 16. Thenon-transitory computer readable storage medium of claim 12, wherein theprotection mechanism that applies to all traffic that has any of thefirst plurality of identifiers comprises increasing an amount ofsecurity analysis performed on the traffic that has any of the firstplurality of identifiers.
 17. The non-transitory computer readablestorage medium of claim 12, wherein the amount of time is specific tothe first suspected botnet, wherein the amount of time is based upon anaverage or maximum attack length of time determined based upon previousactivity of the first suspected botnet.
 18. The non-transitory computerreadable storage medium of claim 12, wherein the amount of time isindefinite in that it continues until a condition is satisfied, whereinthe condition is satisfied upon a determination, by the TMM, that norequest messages have been received at the TMM that include any of thefirst plurality of identifiers for a threshold amount of time.
 19. Thenon-transitory computer readable storage medium of claim 12, wherein theoperations further comprise: receiving, at the TMM from a third of theplurality of end stations, a third request message that is destined forone of the one or more servers and that includes at least one of thefirst plurality of identifiers; and blocking, at the TMM as part of theprotection mechanism before an end of the amount of time, the thirdrequest message from being sent to its destination due to the protectionmechanism being activated.
 20. The non-transitory computer readablestorage medium of claim 12, wherein: the received message that includesthe first plurality of identifiers further includes a second pluralityof identifiers that have been determined to be used by a subset of theplurality of end stations collectively acting as a second suspectedbotnet; the second identifier exists within both the first plurality ofidentifiers and the second plurality of identifiers; and the activatedprotection mechanism further applies to all traffic that has any of thesecond plurality of identifiers due to the second identifier alsoexisting within the second plurality of identifiers.